Recombination Operators in Genetic Algorithm - Based Crawler: Study and Experimental Appraisal
نویسندگان
چکیده
A focused crawler traverses the web selecting out relevant pages according to a predefined topic. While browsing the internet it is difficult to identify relevant pages and predict which links lead to high quality pages. This paper proposes a topical crawler for Vietnamese web pages using greedy heuristic and genetic algorithms. Our crawler based on genetic algorithms uses different recombination operators in the genetic algorithms to improve the crawling performance. We tested our algorithms on Vietnamese newspaper VnExpress websites. Experimental results show the efficiency and the viability of our approach.
منابع مشابه
STRUCTURAL OPTIMIZATION USING A MUTATION-BASED GENETIC ALGORITHM
The present study is an attempt to propose a mutation-based real-coded genetic algorithm (MBRCGA) for sizing and layout optimization of planar and spatial truss structures. The Gaussian mutation operator is used to create the reproduction operators. An adaptive tournament selection mechanism in combination with adaptive Gaussian mutation operators are proposed to achieve an effective search in ...
متن کاملOPTIMAL OPERATORS OF GENETIC ALGORITHM IN OPTIMIZING SEGMENTAL PRECAST CONCRETE BRIDGES SUPERSTRUCTURE
Bridges constitute an expensive segment of construction projects; the optimization of their designs will affect their high cost. Segmental precast concrete bridges are one of the most commonly serviced bridges built for mid and long spans. Genetic algorithm is one of the most widely applied meta-heuristic algorithms due to its ability in optimizing cost. Next to providing cost optimization of t...
متن کاملApplication of Genetic Algorithm in Kinetic Modeling and Reaction Mechanism Studies
This study is focused on the development of a systematic computational approach which implements Genetic Algorithm (GA) to find the optimal rigorous kinetic models.A general Kinetic model for hydrogenolysis of dibenzothiophene (DBT) based on Langmuir-Hinshelwood type has been obtained from open literature. This model consists of eight continuous parameters(e.g., Arrhenus and Van't...
متن کاملSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملAppraisal of the evolutionary-based methodologies in generation of artificial earthquake time histories
Through the last three decades different seismological and engineering approaches for the generation of artificial earthquakes have been proposed. Selection of an appropriate method for the generation of applicable artificial earthquake accelerograms (AEAs) has been a challenging subject in the time history analysis of the structures in the case of the absence of sufficient recorded accelerogra...
متن کامل